Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems
نویسندگان
چکیده
We propose a substructuring preconditioner for solving threedimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with much simpler coarse solvers. Though the condition number of the preconditioned system may not have a good bound, we are able to show that the convergence rate of the PCG method with such substructuring preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficient in the elliptic equation.
منابع مشابه
A Nonoverlapping Domain Decomposition Method 3
A parallel iterative nonoverlapping domain decomposition method is proposed and analyzed for elliptic problems. Each iteration in this method contains two steps. In the rst step, at the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires Neumann data be passed to it. In the ...
متن کاملMultiscale mortar mixed methods for heterogeneous elliptic problems
Consider solving a second order elliptic problem when the elliptic coefficient is highly heterogeneous. Generally, a numerical method either uses a very fine computational mesh to resolve the heterogeneities and therefore becomes computationally inefficient, or it performs efficiently on a coarse mesh but gives inaccurate results. Standard nonoverlapping domain decomposition using mortar spaces...
متن کاملNonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner introduced in Bramble, Pasiack and Schatz (1989), with simpler coarse solvers. We will show that, although the preconditioned system may not have a good...
متن کاملMultiscale Domain Decomposition Methods for Elliptic Problems with High Aspect Ratios
In this paper we study some nonoverlapping domain decomposition methods for solving a class of elliptic problems arising from composite materials and flows in porous media which contain many spatial scales. Our preconditioner differs from traditional domain decomposition preconditioners by using a coarse solver which is adaptive to small scale heterogeneous features. While the convergence rate ...
متن کاملBDDC Algorithms for Incompressible Stokes Equations
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle-point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are iterative substructuring methods, which form a class of domain decomposition methods based on the decomposition of the domain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 79 شماره
صفحات -
تاریخ انتشار 2010